1861A - Prime Deletion - CodeForces Solution

/******************
    Author : CR_2683
******************/

#include <bits/stdc++.h>
using namespace std;

#define nl "\n"
#define dis(x) cout<<"x= "<<x<<nl
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define ld long double
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pi pair<int,int>
#define pll pair<ll,ll>
#define mp make_pair
#define vpi vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define pb push_back
#define all(v) v.begin(),v.end()
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);

void solveProblem(){
     
     string s;
     cin>>s;

     ll idx1 , idx2;

     for(int i=0;i<s.size();i++){

        if(s[i]=='1'){

            idx1=i+1;
        }
        if(s[i]=='3'){

            idx2=i+1;
        }
     }

     if(idx1 < idx2){

        cout<<13<<endl;

     }
     else{

        cout<<31<<endl;
     }
}

int main()
{
    

    ll test;
    cin>>test;

    while(test--){
        solveProblem();
    }

    return 0;
}